Solving Irregular Problems through Parallel Irregular Trees
نویسندگان
چکیده
This paper presents PIT, a library for the parallelization of irregular problems on distributed memory architectures. All the strategies underlying the definition of the library can be expressed in terms of operations on a PITree, a parallel version of the tree data structure oriented to irregular problems. We consider the application of PIT to two well known irregular problems: adaptive multigrid and hierarchical radiosity methods. Performance figures that prove the effectiveness of PIT are presented.
منابع مشابه
Parallelization of irregular algorithms for shape detection
There are a series of very eecient sequential algorithms that generate irregular trees during the process of detecting shapes in images. These algorithms are based on the Fast Hough Transform and are used for solving the most complex stages of detection when the production of the parameters is uncoupled. However, the parallelization of these algorithms is complex, and the problem of load distri...
متن کاملImplementation of D3Q19 Lattice Boltzmann Method with a Curved Wall Boundary Condition for Simulation of Practical Flow Problems
In this paper, implementation of an extended form of a no-slip wall boundary condition is presented for the three-dimensional (3-D) lattice Boltzmann method (LBM) for solving the incompressible fluid flows with complex geometries. The boundary condition is based on the off-lattice scheme with a polynomial interpolation which is used to reconstruct the curved or irregular wall boundary on the ne...
متن کاملTechniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors
Graph problems are finding increasing applications in high performance computing disciplines. Although many regular problems can be solved efficiently in parallel, obtaining efficient implementations for irregular graph problems remains a challenge. We propose techniques for designing and implementing efficient parallel algorithms for graph problems on symmetric multiprocessors and chip multipr...
متن کاملA Discrete Singular Convolution Method for the Seepage Analysis in Porous Media with Irregular Geometry
A novel discrete singular convolution (DSC) formulation is presented for the seepage analysis in irregular geometric porous media. The DSC is a new promising numerical approach which has been recently applied to solve several engineering problems. For a medium with regular geometry, realizing of the DSC for the seepage analysis is straight forward. But DSC implementation for a medium with ir...
متن کاملRun-Time Techniques for Exploiting Irregular Task Parallelism on Distributed Memory Architectures
Automatic scheduling for directed acyclic graphs (DAG) and its applications for coarse-grained irregular problems such as large n-body simulation have been studied in the literature. However solving irregular problems with mixed granularities such as sparse matrix factorization is challenging since it requires eecient run-time support to execute a DAG schedule. In this paper, we investigate run...
متن کامل